An Interpolating Decision Procedure for Transitive Relations with Uninterpreted Functions
نویسندگان
چکیده
منابع مشابه
Fuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملCSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementation combines the efficiency of linear programming for solving the arithmetic part with the efficiency of a SAT solver to reason about the boolean structure. We evaluate the efficiency of our tool on benchmarks from s...
متن کاملInterpolation-Based Software Verification with Wolverine
Wolverine is a software verification tool using Craig interpolation to compute invariants of ANSI-C and C++ programs. The tool is an implementation of the lazy abstraction approach, generating a reachability tree by unwinding the transition relation of the input program and annotating its nodes with interpolants representing safe states. Wolverine features a built-in interpolating decision proc...
متن کاملA Decision Procedure for Monotone Functions over Lattices
This paper presents a practical decision procedure for the unquantified theory of lattices with monotone functions. Specifically, it considers the unquantified language Lmf with the predicates = and ≤ and with the operators inf and sup over terms which may involve also uninterpreted function symbols. Additional predicates expressing increasing and decreasing monotonicity of functions are allowe...
متن کاملDeciding and Interpolating Algebraic Data Types by Reduction (Technical Report)
Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this point, several state-of-the-art theorem provers and SMT solvers include tailor-made decision procedures for ADTs, and version 2.6 of the SMT-LIB standard includ...
متن کامل